Hot Block Clustering for Disk Arrays with Dynamic

نویسندگان

  • Kazuhiko Mogi
  • Masaru Kitsuregawa
چکیده

RAID5 disk arrays provide high performance and high reliability for reasonable cost. However RAID5 suffers a performance penalty during block updates. In order to overcome this problem, the use of dynamic striping was proposed. This method bu ers a number of updates, generates a new stripe composed of newly updated blocks, and then writes the new full stripe back to disks. In this paper, we examine the effect of access locality on the dynamic striping method. To further improve performance in such an environment, we introduce the dynamic clustering policy for hot blocks. Performance analysis with various access localities shows that this method has higher performance than ordinary methods. Performance is also examined for localities that change over time. The dynamic clustering of hot blocks follows locality transitions, showing that under dynamic conditions performance improves.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hot Block Clustering for Disk Arrays with Dynamic Striping

RAID5 disk arrays provide high performance and high reliability for reasonable cost. However RAID5 suffers a performance penalty during block updates. In order to overcome this problem, the use of dynamic striping was proposed. This method buffers a number of updates, generates a new stripe composed of newly updated blocks, and then writes the new full stripe back to disks. In this paper, we ex...

متن کامل

File Allocation over Disk Arrays forVideo - On -

A Video-on-Demand (VOD) server needs to store hundreds of movie titles and to support thousands of concurrent accesses. This, technically and economically, imposes a great challenge on the design of the disk storage subsystem of a VOD server. Due to diierent demands for diierent movie titles, the numbers of concurrent accesses to diierent movie titles can diier a lot. We deene access proole as ...

متن کامل

Eecient Video Allocation for Video-on-demand Services

A Video-on-Demand (VOD) server needs to store hundreds of movie titles and to support thousands of concurrent accesses. This, technically and economically, imposes a great challenge on the design of the disk storage subsystem of a VOD server. Due to diierent demands for diierent movie titles, the numbers of concurrent accesses to each movie can diier a lot. We deene access proole as the number ...

متن کامل

CRAID: online RAID upgrades using dynamic hot data reorganization

Current algorithms used to upgrade RAID arrays typically require large amounts of data to be migrated, even those that move only the minimum amount of data required to keep a balanced data load. This paper presents CRAID, a self-optimizing RAID array that performs an online block reorganization of frequently used, long-term accessed data in order to reduce this migration even further. To achiev...

متن کامل

Latent Sector Faults and Reliability of Disk Arrays

This thesis studies the effects of latent sector faults on reliability, performance, and combined performability of disk arrays. This is done by developing two novel reliability models that include two fault types: disk unit faults and sector faults. The new reliability models study both hot swap and hot spare approaches in repairing disk unit faults. A traditional analytical method and also a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995